Dynamic TAG and Lexical Dependencies

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic TAG and lexical dependencies

Incrementality is a widely held assumption that constrains the language processor to parse the input words from left to right, and to carry out a semantic interpretation of the partial structures (Marslen-Wilson, 1973). The detailed specification of the incremental syntactic process is often addressed by assuming a parsimonious version of incrementality that we can call strong connectivity (Sta...

متن کامل

Wh-dependencies in Romanian and TAG

The aim of this paper is to analyse the wh movement for Romanian in TAG formalisrn. Romanian shares free extractibility from tensed clauses with its Rornance sister languages and it has borrowed multiple wh-fronting from the slavic languages. These features of Rornanian are quoted by Kroch (1989) frorn Comorovsky (1986) , where he justifies the analysis of extractions in TAG. This formalism all...

متن کامل

Modeling Tag Dependencies in Tagged Documents

We present a general approach for modeling tagged documents with topic models. This approach extends related topic models by exploiting the dependencies between tags. We show how this model improves performance in a prediction task where the goal is to predict missing tags for new documents. Predictions also compare favorably with SVMs.

متن کامل

TAG Analysis of Turkish Long Distance Dependencies

All permutations of a two level embedding sentence in Turkish is analyzed, in order to develop an LTAG grammar that can account for Turkish long distance dependencies. The fact that Turkish allows only long distance topicalization and extraposition is shown to be connected to a condition-the coherence condition-that draws the boundary between the acceptable and inacceptable permutations of the ...

متن کامل

Incremental CFG Parsing with Statistical Lexical Dependencies

Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however, too many structures are produced, and therefore its parsing speed becomes very slow. This paper describes a technique for efficient incremental parsing using lexical information. The probability concerning dependencie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research on Language and Computation

سال: 2007

ISSN: 1570-7075,1572-8706

DOI: 10.1007/s11168-007-9032-4